Incremental Grammar Development using Finite State Tools
نویسنده
چکیده
Finite State parsing tools are generally optimized for run-time efficiency. But a field linguist needs compile-time efficiency, so that incremental changes can be made quickly as new morphemes are discovered and grammar rules revised. Using an available finite state toolkit, the Xerox xfst program, I show how incremental changes can be rapidly compiled by extracting the set of morphemes which can co-occur with a given morpheme, imposing constraints and rules on only that subset plus the new morpheme, and merging the constrained subset back into the larger lexicon.
منابع مشابه
Strengths and weaknesses of finite-state technology: a case study in morphological grammar development
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural language processing stems from four sources: modularity of the design, due to the closure properties of regular languages and relations; the compact representation that is achieved through minimization; efficiency, which ...
متن کاملFinite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural language processing stems from four sources: modularity of the design, due to the closure properties of regular languages and relations; the compact representation that is achieved through minimization; efficiency, which ...
متن کاملPorting Basque Morphological Grammars to foma, an Open-Source Tool
Basque is a morphologically rich language, of which several finite-state morphological descriptions have been constructed, primarily using the Xerox/PARC finite-state tools. In this paper we describe the process of porting a previous description of Basque morphology to foma, an open-source finite-state toolkit compatible with Xerox tools, provide a comparison of the two tools, and contrast the ...
متن کاملSoftware Tools for Understanding Grammatical Inference Algorithms: Part I – Tools for Regular Grammars and Finite-State Automata
Software demonstrators are effective tools to show and understand scientific and engineering concepts in function, and they also allow rapid experiments. In the field of grammatical inference, there is a lack of “ready-to-use” grammar synthesis tools, with simple interfaces showing intermediate stages of the grammar inference process, and the presented work addresses this issue by giving tools ...
متن کاملPhrase Structure in a Computational Model O F Child Language Acquisition
This thesis describes a computational model of child language acquisition which acquires a recursive phrase-structure grammar in the absence of X-Bar Theory. The model assumes no grammar, lexicon, or segmentation. Input utterances include phrases as well as sentences, of no more than two levels of embedding, paired with their semantic representations. The initial products of acquisition are a l...
متن کامل